Overgenerating Referring Expressions Involving Relations and Booleans
نویسنده
چکیده
We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and negations. The focus of this paper is on generating referring expressions involving positive and negated relations. We describe rule-based overgeneration of referring expressions based on the notion of ‘extension’, and show how to constrain the search space by interleaving logical form generation with realization and expressing preferences by means of costs. Our chart-based framework allows us to develop a search-based solution to the problem of ‘recursive’ relations.
منابع مشابه
Kees Van Deemter and Emiel Krahmer Graphs and Booleans: on the Generation of Referring Expressions
Generation of Referring Expressions (gre) is a key task of Natural Language Generation nlg systems (e.g., Reiter and Dale, 2000, section 5.4). The task of a gre algorithm is to find combinations of properties that allow the generator to refer uniquely to an object or set of objects, called the target of the algorithm. Older gre algorithms tend to be based on a number of strongly simplifying ass...
متن کاملGenerating Referring Expressions Involving Relations
In this paper we review Dale s algorithm for determining the content of a referring expres sion The algorithm which only permits the use of one place predicates is revised and extended to deal with n ary predicates We investigate the problem of blocking recursion in complex noun phrases and propose a solution in the context of our algorithm
متن کاملGenerating Referential Descriptions Involving Relations by a Best-First Searching Procedure - A System Demo
Despite considerable research invested in the generation of referring expressions (GRE), there still exists no adequate generic procedure for GRE involving relations. In this paper, we present a system for GRE that combines attributes and relations, using best-first search technique. Preliminary evaluations show its effectiveness; the design enables the use of heuristics that meet linguistic pr...
متن کاملGraphs and Spatial Relations in the Generation of Referring Expressions
When they introduced the Graph-Based Algorithm (GBA) for referring expression generation, Krahmer et al. (2003) flaunted the natural way in which it deals with relations between objects; but this feature has never been tested empirically. We fill this gap in this paper, exploring referring expression generation from the perspective of the GBA and focusing in particular on generating human-like ...
متن کاملGroup-Based Generation of Referring Expressions
Past work of generating referring expressions mainly utilized attributes of objects and binary relations between objects in order to distinguish the target object from others. However, such an approach does not work well when there is no distinctive attribute among objects. To overcome this limitation, this paper proposes a novel generation method utilizing perceptual groups of objects and n-ar...
متن کامل